Solving Fuzzy Temporal Problems Without Backtracking
نویسندگان
چکیده
The Disjunctive Fuzzy Temporal Constraint Network model allows to express complex qualitative and quantitative temporal constraints, but its complexity is exponential. There are several subsets of these networks that can be solved in polynomial time. Another subset can be reduced to equivalent networks with a tree structure. In order to study the usefulness of these approaches, an evaluation has been carried out, generating sets of random test problems. The goal is to obtain a set of methods for managing Disjunctive Fuzzy Temporal Constraint Networks, integrating them in a general-purpose module, and to obtain, if possible, heuristic knowledge for selecting the most suitable method for each concrete problem.
منابع مشابه
Applying Local Search to Temporal Reasoning
Local search techniques have attracted considerable interest in the Artificial Intelligence (AI) community since the development of GSAT [9] and the min-conflicts heuristic [5] for solving large propositional satisfiability (SAT) problems and binary Constraint Satisfaction Problems (CSPs) respectively. Newer SAT techniques, such as the Discrete Langrangian Method (DLM) [10], have significantly ...
متن کاملSolving Over-Constrained Temporal Reasoning Problems Using Local Search
Temporal reasoning is an important task in many areas of computer science including planning, scheduling, temporal databases and instruction optimisation for compilers. Given a knowledge-base consisting of temporal relations, the main reasoning problem is to determine whether the knowledge-base is satisfiable, i.e., is there a scenario which is consistent with the information provided. However,...
متن کاملUse of Prologiii in Teaching Artiicial Intelligence Techniques Mm Aria Smoll Arovv A, Pavol Nn Avrat
At The Faculty of Electrical Engineering and Information Technology in Bratislava, teaching Artiicial Intelligence involves various problem solving techniques, among them also constraint satisfaction. Recently, we have introduced programming language PrologIII to students specializing in Software Engineering. As a part of the subject Methods and Techniques of Artiicial Intelligence, which is an...
متن کاملWeak-Commitment Search for Solving Constraint Satisfaction Problems
The min-conflict heuristic (Minton et al. 1992) has been introduced into backtracking algorithms and iterative improvement algorithms as a powerful heuristic for solving constraint satisfaction problems. Backtracking algorithms become inefficient when a bad partial solution is constructed, since an exhaustive search is required for revising the bad decision. On the other hand, iterative improve...
متن کاملAn asynchronous algorithm to improve scheduling quality in the multiagent simple temporal problem
Even though modeling and solving multiagent scheduling problems seem completely understood and several algorithms can be found in the literature, one limitation still stands up: How to find a compatible time slot for an activity shared by many users without requiring the users themselves to spend time going through their calendar and choosing time slots until everybody agrees. This extended abs...
متن کامل